High-Order Factorization Based High-Order Hybrid Fast Sweeping Methods for Point-Source Eikonal Equations
نویسندگان
چکیده
The solution for the eikonal equation with a point-source condition has an upwind singularity at the source point as the eikonal solution behaves like a distance function at and near the source. As such, the eikonal function is not differentiable at the source so that all formally high-order numerical schemes for the eikonal equation yield first-order convergence and relatively large errors. Therefore, it is a longstanding challenge in computational geometrical optics how to compute a uniformly high-order accurate solution for the point-source eikonal equation in a global domain. In this paper, assuming that both the squared slowness and the squared eikonal are analytic near the source, we propose high-order factorization based high-order hybrid fast sweeping methods for point-source eikonal equations to compute just such solutions. Observing that the squared eikonal is differentiable at the source, we propose to factorize the eikonal into two multiplicative or additive factors, one of which is specified to approximate the eikonal up to arbitrary order of accuracy near the source, and the other of which serves as a higher-order correction term. This decomposition is achieved by using the eikonal equation and applying power series expansions to both the squared eikonal and the squared slowness function. We develop recursive formulas to compute the approximate eikonal up to arbitrary order of accuracy near the source. Furthermore, these approximations enable us to decompose the eikonal into two factors, either multiplicatively or additively, so that we can design two new types of hybrid, high-order fast sweeping schemes for the point-source eikonal equation. We also show that the first-order hybrid fast sweeping methods are monotone and consistent so that they are convergent in computing viscosity solutions. Twoand three-dimensional numerical examples demonstrate that a hybrid pth order fast sweeping method yields desired, uniform, clean pth order convergence in a global domain by using a pth order factorization.
منابع مشابه
Fast Sweeping Methods for Factored Anisotropic Eikonal Equations: Multiplicative and Additive Factors
The viscosity solution of static Hamilton-Jacobi equations with a pointsource condition has an upwind singularity at the source, which makes all formally high-order finite-difference scheme exhibit first-order convergence and relatively large errors. To obtain designed high-order accuracy, one needs to treat this source singularity during computation. In this paper, we apply the factorization i...
متن کاملA uniformly second order fast sweeping method for eikonal equations
A uniformly second order method with a local solver based on the piecewise linear discontinuous Galerkin formulation is introduced to solve the eikonal equation with Dirichlet boundary conditions. The method utilizes an interesting phenomenon, referred as the superconvergence phenomenon, that the numerical solution of monotone upwind schemes for the eikonal equation is first order accurate on b...
متن کاملUniformly Accurate Discontinuous Galerkin Fast Sweeping Methods for Eikonal Equations
In [F. Li, C.-W. Shu, Y.-T. Zhang, H. Zhao, Journal of Computational Physics 227 (2008) 81918208], we developed a fast sweeping method based on a hybrid local solver which is a combination of a discontinuous Galerkin (DG) finite element solver and a first order finite difference solver for Eikonal equations. The method has second order accuracy in the L norm and a very fast convergence speed, b...
متن کاملNumerical Boundary Conditions for the Fast Sweeping High Order WENO Methods for Solving the Eikonal Equation
High order fast sweeping methods have been developed recently in the literature to solve static Hamilton-Jacobi equations efficiently. Comparing with the first order fast sweeping methods, the high order fast sweeping methods are more accurate, but they often require additional numerical boundary treatment for several grid points near the boundary because of the wider numerical stencil. It is p...
متن کاملA Third Order Fast Sweeping Method with Linear Computational Complexity for Eikonal Equations
Fast sweeping methods are a class of efficient iterative methods for solving steady state hyperbolic PDEs. They utilize the Gauss-Seidel iterations and alternating sweeping strategy to cover a family of characteristics of the hyperbolic PDEs in a certain direction simultaneously in each sweeping order. The first order fast sweeping method for solving Eikonal equations (Zhao in Math Comput 74:60...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 52 شماره
صفحات -
تاریخ انتشار 2014